A Monte Carlo method for solving unsteady adjoint equations
نویسندگان
چکیده
Traditionally, solving the adjoint equation for unsteady problems involves solving a large, structured linear system. This paper presents a variation on this technique and uses a Monte Carlo linear solver. The Monte Carlo solver yields a forward-time algorithm for solving unsteady adjoint equations. When applied to computing the adjoint associated with Burgers’ equation, the Monte Carlo approach is faster for a large class of problems while preserving sufficient accuracy. 2008 Elsevier Inc. All rights reserved.
منابع مشابه
Monte Carlo Simulation to Solve the Linear Volterra Integral Equations of The Second Kind
This paper is intended to provide a numerical algorithm based on random sampling for solving the linear Volterra integral equations of the second kind. This method is a Monte Carlo (MC) method based on the simulation of a continuous Markov chain. To illustrate the usefulness of this technique we apply it to a test problem. Numerical results are performed in order to show the efficiency and accu...
متن کاملRisk Quantification in Unsteady Flow Simulations Using Adjoint-Based Approaches
In this paper, we study the unsteady flow past a circular cylinder subject to rotational oscillations. The uncertainties induced by the unknown frequency, magnitude and phase with respect to the vortex shedding are treated as sources of stochasticity, and we consider the problem of quantifying the tail probability distribution of the aerodynamic forces. Specifically we estimate the probability ...
متن کاملImportance Sampling and Adjoint Hybrid Methods in Monte Carlo Transport with Reflecting Boundaries
Adjoint methods form a class of importance sampling methods that are used to accelerate Monte Carlo (MC) simulations of transport equations. Ideally, adjoint methods allow for zero-variance MC estimators provided that the solution to an adjoint transport equation is known. Hybrid methods aim at (i) approximately solving the adjoint transport equation with a deterministic method; and (ii) use th...
متن کاملDirect and Adjoint Monte Carlo Algorithms for the Footprint Problem
| Lagrangian stochastic models and algorithms are constructed and justi ed for solving the footprint problem, namely, the problem of calculation of the mean concentration and the ux of particles at a xed point released from a source arbitrarily situated in the space. The direct and adjoint Monte Carlo algorithms are suggested, and rigorous justi cations are given. Two di erent backward trajecto...
متن کاملLocal-in-time adjoint-based method for design optimization of unsteady flows
We present a new local-in-time discrete adjoint-based methodology for solving design optimization problems arising in unsteady aerodynamic applications. The new methodology circumvents storage requirements associated with the straightforward implementation of a global adjoint-based optimization method that stores the entire flow solution history for all time levels. This storage cost may quickl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comput. Physics
دوره 227 شماره
صفحات -
تاریخ انتشار 2008